[20260126] BOJ / G5 / 배 / 이준희 #1837
Merged
+52
−0
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1092
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
박스에 들어있는 짐을 크레인을 이용하여 배에 싣고 이동할 예정입니다.
이 때 각 크레인들은 무게제한이 있을 때 모든 짐을 배에 싣는 최소 시간을 구하는 문제입니다.
🔍 풀이 방법
크레인과 짐을 무게 순으로 정렬한 후 구현으로 풀었습니다.
각 크레인은 남은 짐들 중 무게제한에 걸리지 않는 선에서 가장 무거운 짐을 옮깁니다.
이후 모든 짐을 처리했을 때의 시간을 출력했습니다.
⏳ 회고
정렬 후 무게 순으로 처리하는 방식만 생각하면 쉬웠던 문제였습니다.